Multi-objective Optimization Problems with SOS-convex Polynomials over an LMI Constraint

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Objective Constraint Optimization with Tradeoffs

In this paper, we consider the extension of multi-objective constraint optimization algorithms to the case where there are additional tradeoffs, reducing the number of optimal solutions. We focus especially on branch-and-bound algorithms which use a mini-buckets algorithm for generating the upper bound at each node (in the context of maximizing values of objectives). Since the main bottleneck o...

متن کامل

Convergent LMI relaxations for non-convex optimization over polynomials in control

It is well known that most analysis and design problems in robust and nonlinear control can be formulated as global optimization problems with polynomial objective functions and constraints [1]. Typical examples include robust stability analysis for characteristic polynomials with parametric uncertainty, simultaneous stabilization of linear systems, pole assignment by static output feedback, an...

متن کامل

Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems

We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the solution of the problem scalarized via a convex combination of objectives through a vector of parameters (or weights). Then we establish that (i) the solution of the scalarized (parametric) problem for any given paramete...

متن کامل

An approximation algorithm for convex multi-objective programming problems

In multi-objective convex optimization it is necessary to compute an infinite set of nondominated points. We propose a method for approximating the nondominated set of a multi-objective nonlinear programming problem, where the objective functions and the feasible set are convex. This method is an extension of Benson’s outer approximation algorithm for multi-objective linear programming problems...

متن کامل

Multi-objective Optimization of Tip Tracking Control Using Lmi

This paper presented multi-objective optimization of tip tracking control for non-collocated flexible beam. The desired trajectory is specified at the tip displacement of the flexible structure, which undergoes translation base motion actuated by a linear motor. The system model is first formulated from modal truncation approach for the flexible structure representing a single Cartesian robot m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Taiwanese Journal of Mathematics

سال: 2020

ISSN: 1027-5487

DOI: 10.11650/tjm/191002